S ep 2 00 6 RETURN WORDS IN THE THUE - MORSE AND OTHER SEQUENCES
نویسندگان
چکیده
We present three simple ideas which enable to determine easily the number of return words in some infinite words. Using these ideas, we give a new and very short proof of the fact that each factor of an Arnoux-Rauzy word of order m has exactly m return words. We describe the structure of return words for the Thue-Morse sequence and focus on infinite words which are associated to simple Parry numbers.
منابع مشابه
Return Words in the Thue-morse and Other Sequences
We present three simple ideas which enable to determine easily the number of return words in some infinite words. Using these ideas, we give a new and very short proof of the fact that each factor of an Arnoux-Rauzy word of order m has exactly m return words. We describe the structure of return words for the Thue-Morse sequence and focus on infinite words which are associated to simple Parry nu...
متن کاملSubword complexity and power avoidance
We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that – the Thue-Morse word has the minimum possible subword complexity over all overlapfree binary words and all (73)-power-free binary words, but not over all ( 7 3) +-power-free binary words; – the twisted Thue-Morse word has the maximum possible sub...
متن کاملSmooth words over arbitrary alphabets
Smooth infinite words over Σ = {1, 2} are connected to the Kolakoski word K = 221121 · · ·, defined as the fixpoint of the function ∆ that counts the length of the runs of 1’s and 2’s. In this paper we extend the notion of smooth words to arbitrary alphabets and study some of their combinatorial properties. Using the run-length encoding ∆, every word is represented by a word obtained from the i...
متن کاملOn the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving)
In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible symmetric Motzkin paths and paths in Z not returning to the origin. This study can be extended to abelian unbordered words over an arbitrary alphabet and we derive expressions to compute the number...
متن کاملNondeterministic Automatic Complexity of Overlap-Free and Almost Square-Free Words
Shallit and Wang studied deterministic automatic complexity of words. They showed that the automatic Hausdorff dimension I(t) of the infinite Thue word satisfies 1/3 6 I(t) 6 1/2. We improve that result by showing that I(t) = 1/2. We prove that the nondeterministic automatic complexity AN (x) of a word x of length n is bounded by b(n) := bn/2c+ 1. This enables us to define the complexity defici...
متن کامل